A function f : AmapsB is said to be surjective (or onto) if for every y element of B there exists x element of A such that f(x) = y. Let G and H be groups. A function f :GmapsH which satisfies (1) for all g, g' element of G is called a homomorphism of G into H. If f:GmapsH is a homomorphism. The kernel of f is ker(f) = {x element of G | f(x) = 1H}. Let M be a proper ideal of R. Then if M is a maximal ideal for all x element of R - M. we have M + (x) = R. An ideal M of R is said to be a maximal ideal if (a) M is a proper ideal and (b) if A is a proper ideal containing M, then M = A. A commutative ring R is an integral domain if R contains no zero divisors. In other words, R is an integral domain if the product of any two nonzero elements of R is nonzero. Let P be and ideal of R, P not equal (1). We say that P is a prime ideal if, whenever a,b element of R have the property that ab element of P, then either a element of P or b element of P. Let R be a unique factorization domain, a,b,pi element of R, pi irreducible. If pi|ab, then pi|a or pi|b. A ring R having the property that every ideal is principal is called a principal ideal ring (PIR). If, in addition, R is an integral domain, then R is called a principal ideal domain (PID). We say that R is a unique factorization domain if the following two conditions are satisfied: (1) If x element of Rx is not a unit of R, then x can be written as a product of irreducible elements of R, and (2) If x element of Rx is not a unit of R, and if x = pi1 ... pis = lambda1 ... lambdat are two expressions of x as a product of irreducible elements, then s = t and it is possible to renumber pi1 ... pis so that pi1 and lambda1 are associates (1 < i < s). Let p be a prime. If p divides a product ab, then either p divides a or p divides b. The set of integers. Let R be a ring. An ideal of R is a subring I of R such that if a element of I, r element of R, then a · r element of I and r · a element of I.

Prime and Maximal Ideals

Throughout this section, let R be a commutative ring with identity.

Definition 1: Let P be and ideal of R, P not equal (1). We say that P is a prime ideal if, whenever a,b element of R have the property that ab element of P, then either a element of P or b element of P.

Example 1: Let R = Z and let p be prime. Then (p) is a prime ideal. For each ab element of (p), then p|ab. Therefore, by Euclid's lemma, p|a or p|b and thus either a element of (p) or b element of (p).

Example 2: Example 1 suggests the following generalization. Let R be a UFD and let pi be an irreducible element of R. Then (pi) is a prime ideal. The proof is the same as Example 1, except Proposition 5 of the section on factorization in polynomial rings is used rather than Euclid's lemma.

Example 3: Let R = F[X,Y]. We will prove below that (X,Y) is a prime ideal. (See Corollary 4).

Example 4: Let R = Z. Then (4) is not a prime ideal, since 2 not an element of(4), but 2 · 2 element of (4).

Proposition 2: Let R be a principal ideal domain. Then the prime ideals of R are of the form (pi), where pi is an irreducible element of R or pi = 0.

Proof: Let P be a prime ideal of R. Assume that P not equal (0). Since P is a nontrivial ideal of R, P = (a) for a element of Rx, where a is a nonunit. Since R is a PID, R is a UFD, so we may write a = pi1...pir, where pii is an irreducible element of R. Suppose that r > 2. Set b = pi1, c = pi2...pir. Then bc element of P. Moreover, b not an element of P and c not an element of P. (For example, if b element of P, then b = da for some d element of R, so that 1 = dc, and thus c is a unit, which is a contradiction.) This contradicts the assumption that P is prime. Thus, r = 1 and P = (pi1). On the other hand, if P = (pi), where pi is irreducible, then P is prime by Example 2. The ideal (0) is prime since a · b element of (0), then either a = 0 or b = 0 since R is an integral domain.

Theorem 3: Let P be an ideal of R, a commutative ring with identity, P not equal (1). Then P is a prime ideal if and only if R/P is an integral domain.

Proof: forward implication Assume that P is a prime ideal. It is clear that R/P is a commutative ring with identity. To show that R/P is an integral domain, we must show that if a + P, b + P element of R/P are such that (a + P)(b + P) = 0 + P, then either a + P = 0 + p b + P = 0 + P. But (a + P)(b + P) = ab + P, so that if (a + P)(b + P) = 0 + P ab element of P. Therefore, since P is a prime ideal, either a element of P of b element of P. Thus either a + P or b + P equals 0 + P.

backwards implicationAssume that R/P is an integral domain and that a,b element of R, are such that ab element of P. Then

(a + P)(b + P) = ab + P
= 0 + P

Therefore, since R/P is an integral domain, either a + P or b + P equals 0 + P. Hence either a element of P or b element of P.

Corollary 4: Let F be a field, and let X and Y be indeterminates over F. Then (X,Y) is a prime ideal of F[X,Y].

Proof: Consider the homomorphism

psi: F[X,Y] maps F

defined by mapping f into its value at (0,0). It is easy to see that psi is surjective and ker(psi = (X,Y). Therefore, F[X,Y]/(X,Y)isomorphic toF. But F is an integral domain, so that (X,Y) is a prime ideal by Theorem 3.

If R is a PID, we can rephrase the unique factorization in R in terms of prime ideals. This was the original motivation for introducing prime ideals into mathematics.

Theorem 5: Let R be a principal ideal domain, A an ideal of R, Anot equal(0) or (1). Then A can be written as a product of prime ideals of R, and this expression is unique up to reordering of the prime ideals concerned.

Proof: Let A = (a). Then, since A not equal(0),(1), we see that anot equal0 or a unit of R. Therefore, since R is a UFD, we may write

a = pi1...pis,

pii (1 < i < s) irreducible. but then

A = (a) =(pii)...(pis)

is an expression of A as a product of prime ideals (pi1),...,(pis). Suppose that

A = (pi1)...(pis)
(1)
= (pi'1)...(pi't).

[Every nonzero prime ideal of R is of the form (pi) for pi irreducible.] Then

(pi1...pis) = (pi'1...pi't)
impliespi1...pis = epsilonpi'1...pi't.

where epsilon is a unit of R. But since R is a UFD, s = t and we may renumber pi1,...,pis so that pii and pi'i are associates (1 < i < s). then (pii) = (pi'i) and the two decompositions of (1) are the same except for the order of the prime ideals.

We have seen that there exist fairly simple integral domains (such as Z[square root of -5]) for which unique factorization does not hold. However, it makes sense to inquire whether every nontrivial ideal of such a ring can be written uniquely as a product of prime ideals, where uniqueness is taken to mean up to rearrangement. In essence, this is Kummer's idea. It is easy to see that if unique factorization among ideals holds and if the ring is a UFD, then the ring is a PID. Thus, in the case of all ideals are principal, unique factorization of ideals and unique factorization of elements are equivalent. However, if there exist nonprincipal ideals, then it is possible for unique factorization of ideals to hold even though unique factorization of elements does not. An integral domain in which every nontrivial ideal can be expressed uniquely as a product of prime ideals is called a Dedekind domain. The rings Z[square root of -5] and Z[zeta] are examples of Dedekind domains.

Having introduced the prime ideals of a ring, let us now introduce another important class of ideals - the maximal ideals. An ideal A of R is said to be proper if Anot equalR.

Definition 6: An ideal M of R is said to be a maximal ideal if (a) M is a proper ideal and (b) if A is a proper ideal containing M, then M = A.

We can reformulate the definition of a maximal ideal in a more convenient way:

Lemma 7: Let M be a proper ideal of R. Then if M is a maximal ideal for all x element of R - M. we have M + (x) = R.

Proof: forward implicationLet x element of R - M. Then A = M + (x) is an ideal containing M. If A is proper, then M = A, since M is maximal. But this is impossible, since x element of A - M. Therefore, M + (x) = R.

backwards implicationLet A be a proper ideal containing M, and let x element of A - M. Then M + (x) = R. Thus, A = R, which is a contradiction to the assumption that A is proper. But this implies that A - M = empty set and M superset of A. Therefore, since Msubset ofA, we have M = A and M is maximal.

Example 5: Let R be a PID, pi an irreducible element of R. then (pi) is a maximal ideal. For if x element of R-(pi), then x is not divisible by pi. Thus, since pi is irreducible, x and pi are relatively prime. So there exist a,b element of R such that api + bx = 1. Thus, 1 element of (pi) + (x), and

(pi) + (x) = (1) = R,

so that (pi) is a maximal ideal. In particular, if p is prime, then (p) is a maximal ideal of Z, and if f element of F[X] is irreducible, then (f ) is a maximal ideal of F[X].

Theorem 8: M is a maximal ideal of R if and only if R/M is a field.

Proof: forward implication Assume that M is maximal. Then M is proper, so that R/M is not the trivial ring. Let x + M element of R/M, x + M not equal 0 + M. We must show that x + M is a unit in R/M. But x not an element of M, so that by Lemma 7, M + (x) = R. In particular, 1 element of M + (x), so that there exists a element of R such that 1 - ax element of M. But then (a + M)(x + M) = 1 + M and x + M is a unit in R/M.

backwards implication Assume that R/M is a field. Then R/M is not the trivial ring, so that R/Mnot equal{M} and M is proper. Let x element of R - M. Then x + M not equal0 + M, so that there exists a + M element of R/M such that (a + M)(x + M) = 1 + M. But then 1 - ax element of M and 1 element of (x) + M, so that M + (x) = R. Thus, M is maximal by Lemma 7.

Corollary 9: If M is a maximal ideal, then M is a prime ideal.

Proof: If M is maximal, then R/M is a field by Theorem 8. But a field is an integral domain, so that M is prime by Theorem 3.

We have seen that every maximal ideal is a prime. However, the converse is not true. For example, let R = F[X,Y]. Then (X) is a prime ideal since X is irreducible in R. However, (X) is not a maximal ideal since (X) subset of (X,Y) subset of R and (X,Y) is a proper ideal such that (X,Y) not equal (X).

A maximal ideal cannot be properly contained in any nontrivial ideal. Thus it is natural to ask if every ideal which is not the entire ring is contained in some maximal ideal. This is a highly nontrivial question. Consider the following example. Let C[0,1] denote the set of all continuous real-valued functions on the closed interval [0,1], and let sum and product of functions be defined in the usual way, so that C[0,1] becomes a commutative ring with identity. For each integer j(j = 1,2,3,...) let Ij = X1/2jC[0,1]. Then Ij is a principal ideal and

Ijsubset of I2 subset of ...

Therefore, it is clear that none of the Ij is a maximal ideal. Is there a maximal ideal containing Ij? It is not obvious, but in fact there is. For let I denote the set of all functions in C[0,1] which are zero at x = 0. Then it is easy to see that I is an ideal of C[0,1]. Moreover, I is a maximal ideal, being the kernel of the surjective homomorphism

C[0,1] mapsR,
f mapsf(0).

Thus since R is a field, I is a maximal ideal by Theorem 8. And it is clear that I contains all the ideals Ij.

Theorem 10: Let I be a proper ideal of the commutative ring with identity R. Then I is contained in some maximal ideal of R.

The proof of Theorem 10 will not be given since it rests on a very subtle set-theoretic result known as Zorn's lemma, which in turn is a consequence of the axiom of choice, a set theory axiom which is very convenient to assume and which has actually entered into a number of proofs in this presentation.